Multiobjective programming under nondifferentiable G-V-invexity
نویسندگان
چکیده
منابع مشابه
Nondifferentiable multiobjective programming under generalized dI-invexity
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with inequality constraints. We introduce four new classes of generalized convex functions by combining the concepts of weak strictly pseudoinvex, strong pseudoinvex, weak quasi invex, weak pseudoinvex and strong quasi invex functions in Aghezzaf and Hachimi [Numer. Funct. Anal. Optim. 22 (2001) 775], d-...
متن کاملGeneralized Minimax Programming with Nondifferentiable (G, β)-Invexity
We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz (G, β)-invex. Not only G-sufficient but also G-necessary optimality conditions are established for problem (P). With G-necessary optimality conditions and (G, β)-invexity on hand, we construct dual problem (DI) for the primal one (P) and prove duality results between problems (P) and (DI). These...
متن کاملMultiobjective Variational Programming under Generalized Vector Variational Type I Invexity
Mond-Weir type duals for multiobjective variational problems are formulated. Under generalized vector variational type I invexity assumptions on the functions involved, sufficient optimality conditions, weak and strong duality theorems are proved efficient and properly efficient solutions of the primal and dual problems.
متن کاملTHE NOTION OF V -r-INVEXITY IN DIFFERENTIABLE MULTIOBJECTIVE PROGRAMMING
In this paper, a generalization of convexity, namely V -rinvexity, is considered in the case of nonlinear multiobjective programming problems where the functions involved are differentiable. The assumptions on Pareto solutions are relaxed by means of V -r-invex functions. Also some duality results are obtained for such optimization problems.
متن کاملSemi-infinite Multiobjective Programming with Generalized Invexity
Motivated by important applications, the theory of mathematical programming has been extended to the case of infinitely many restrictions. At the same time, this theory knew remarcable developments since invexity and its further generalizations have been introduced as substitute of convexity. Here, we consider the multiobjective programming with a set of restrictions indexed in a compact. We ob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2016
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1611909a